#include <stdio.h>
#include <string.h>
const int N=100100;
int n,m,l[N],r[N],q[N],c[N],s[N],a[N],f;
int go(int b){
memset(c,0,sizeof(c));
for(int i=0;i<m;++i)if(q[i]&b)++c[l[i]],--c[r[i]+1];
for(int i=1;i<=n;++i)c[i]+=c[i-1],s[i]=s[i-1]+(c[i]<1),a[i]|=c[i]?b:0;
for(int i=0;i<m;++i)if(!(q[i]&b)&&s[r[i]]-s[l[i]-1]<1)return 1;
return 0;
}
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<m;++i)scanf("%d %d %d",&l[i],&r[i],&q[i]);
for(int b=0;!f&&b<30;++b)f|=go(1<<b);
if(f)puts("NO");else{
puts("YES");
for(int i=1;i<=n;++i)printf("%d ",a[i]);
}
}
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |